Data Clustering by Laplacian Regularized `-Graph
نویسندگان
چکیده
`-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum separately without taking into account the geometric structure of the data. Motivated by `-Graph and manifold leaning, we propose Laplacian Regularized `-Graph (LR`-Graph) for data clustering. The sparse representations of LR`-Graph are regularized by the geometric information of the data so that they vary smoothly along the geodesics of the data manifold by the graph Laplacian according to the manifold assumption. Moreover, we propose an iterative regularization scheme, where the sparse representation obtained from the previous iteration is used to build the graph Laplacian for the current iteration of regularization. The experimental results on real data sets demonstrate the superiority of our algorithm compared to `-Graph and other competing clustering methods.
منابع مشابه
Laplacian regularized low rank subspace clustering
The problem of fitting a union of subspaces to a collection of data points drawn from multiple subspaces is considered in this paper. In the traditional low rank representation model, the dictionary used to represent the data points is chosen as the data points themselves and thus the dictionary is corrupted with noise. This problem is solved in the low rank subspace clustering model which deco...
متن کاملRegularized l1-Graph for Data Clustering
l1-Graph has been proven to be effective in data clustering, which partitions the data space by using the sparse representation of the data as the similarity measure. However, the sparse representation is performed for each datum independently without taking into account the geometric structure of the data. Motivated by l1-Graph and manifold leaning, we propose Regularized l1-Graph (Rl1-Graph) ...
متن کاملADMM Pursuit for Manifold Regularized Sparse Coding
In this paper, we propose an efficient ADMM-based algorithm for graph regularized sparse coding that explicitly takes into account the local manifold structure of the data. Specifically, the graph Laplacian representing the manifold structure is used as a regularizer, encouraging the resulting sparse codes to vary smoothly along the geodesics of the data manifold. By preserving locality, the ob...
متن کاملRegularized Laplacian Estimation and Fast Eigenvector Approximation
Recently, Mahoney and Orecchia demonstrated that popular diffusion-based procedures to compute a quick approximation to the first nontrivial eigenvector of a data graph Laplacian exactly solve certain regularized Semi-Definite Programs (SDPs). In this paper, we extend that result by providing a statistical interpretation of their approximation procedure. Our interpretation will be analogous to ...
متن کاملSparse random graphs: regularization and concentration of the Laplacian
We study random graphs with possibly different edge probabilities in the challenging sparse regime of bounded expected degrees. Unlike in the dense case, neither the graph adjacency matrix nor its Laplacian concentrate around their expectations due to the highly irregular distribution of node degrees. It has been empirically observed that simply adding a constant of order 1/n to each entry of t...
متن کامل